Comparative Analysis of Sparse Matrix Algorithms
نویسندگان
چکیده
We evaluate and compare the storage efficiency of different sparse matrix storage formats as index structure for text collection and their corresponding sparse matrixvector multiplication algorithm to perform query processing in information retrieval (IR) application. We show the results of our implementations for several sparse matrix algorithms such as Coordinate Storage (COO), Compressed Sparse Column (CSC), Compressed Sparse Row (CSR), and Block Sparse Row (BSR) sparse matrix algorithms, using a standard text collection. Evaluation is based on the storage space requirement for each indexing structure and the efficiency of the query-processing algorithm. Our results demonstrate that CSR is more efficient in terms of storage space requirement and query processing timing over the other sparse matrix algorithms for Information Retrieval application. Furthermore, we experimentally evaluate the mapping of various existing index compression techniques used to compress index in information retrieval systems (IR) on Compressed Sparse Row Information Retrieval (CSR IR).
منابع مشابه
Investigating the Effects of Hardware Parameters on Power Consumptions in SPMV Algorithms on Graphics Processing Units (GPUs)
Although Sparse matrix-vector multiplication (SPMVs) algorithms are simple, they include important parts of Linear Algebra algorithms in Mathematics and Physics areas. As these algorithms can be run in parallel, Graphics Processing Units (GPUs) has been considered as one of the best candidates to run these algorithms. In the recent years, power consumption has been considered as one of the metr...
متن کاملComparative Analysis of High Performance Solvers for 3D Elliptic Problems
The presented comparative analysis concerns two iterative solvers for 3D linear boundary value problems of elliptic type. After applying the Finite Difference Method (FDM) or the Finite Element Method (FEM) discretization a system of linear algebraic equations has to be solved, where the stiffness matrix is large, sparse and symmetric positive definite. It is well known that the preconditioned ...
متن کاملImage Classification via Sparse Representation and Subspace Alignment
Image representation is a crucial problem in image processing where there exist many low-level representations of image, i.e., SIFT, HOG and so on. But there is a missing link across low-level and high-level semantic representations. In fact, traditional machine learning approaches, e.g., non-negative matrix factorization, sparse representation and principle component analysis are employed to d...
متن کاملSparse Structured Principal Component Analysis and Model Learning for Classification and Quality Detection of Rice Grains
In scientific and commercial fields associated with modern agriculture, the categorization of different rice types and determination of its quality is very important. Various image processing algorithms are applied in recent years to detect different agricultural products. The problem of rice classification and quality detection in this paper is presented based on model learning concepts includ...
متن کاملComparative Analysis of Sparse Signal Reconstruction Algorithms for Compressed Sensing
Compressed sensing (CS) is a rapidly growing field, attracting considerable attention in many areas from imaging to communication and control systems. This signal processing framework is based on the reconstruction of signals, which are sparse in some domain, from a very small data collection of linear projections of the signal. The solution to the underdetermined linear system, resulting from ...
متن کامل